Particle Swarm Based Collective Searching Model for Adaptive Environment
نویسندگان
چکیده
This report presents a pilot study of an integration of particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the collective search behavior of self-organized groups in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social group adaptation for the dynamic environment and to provide insight and understanding of social group knowledge discovering and strategic searching. A new adaptive environment model, which dynamically reacts to the group collective searching behaviors, is proposed in this research. The simulations in the research indicate that effective communication between groups is not the necessary requirement for whole self-organized groups to achieve the efficient collective searching behavior in the adaptive environment. One possible application of this research is building scientific understanding of the insurgency in the count-Insurgent warfare.
منابع مشابه
Modeling the Collective Strategic Searching of Artificial Insurgent Groups: A Particle Swarm Approach
A swarm based social adaptive model is proposed to model multiple insurgent groups’ strategy searching in a dynamic changed environment. This report presents a pilot study on using the particle swarm modeling, a widely used non-linear optimal tool, to model the emergence of insurgency campaign. The objective of this research is to apply the particle swarm metaphor as a model of insurgent social...
متن کاملParticle Swarm Social Model for Group Social Learning in Adaptive Environment
This report presents a study of integrating particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the social learning of self-organized groups and their collective searching behavior in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social learning for a dynamic environment. The research provi...
متن کاملAdaptive Search Protocol Based on Optimized Ant Colony Algorithm in Peer-to-Peer Network
In order to solve the low searching efficiency in the peer-to-peer (P2P) network, introduce the ant colony algorithm with the particle swarm optimization in searching procedure. Present a new adaptive search protocol (SACASP) based on the ant colony algorithm with the particle swarm optimization in the Peer-to-Peer Network. The approach simulates the process of the ants’ searching food, and can...
متن کاملCollective Odor Source Estimation and Search in Time-Variant Airflow Environments Using Mobile Robots
This paper addresses the collective odor source localization (OSL) problem in a time-varying airflow environment using mobile robots. A novel OSL methodology which combines odor-source probability estimation and multiple robots' search is proposed. The estimation phase consists of two steps: firstly, the separate probability-distribution map of odor source is estimated via Bayesian rules and fu...
متن کاملEmergence of representations from a multi-agent implementation of Schelling’s model
In this paper we use the concept of emergent representations issue from decomposition along two axes: collective/individual and internal/external. In a collective/internal composition, emergent representations are seen as internal, stable and non-reactive complex adaptive systems. Based on natural optimization algorithms, like Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007